Derandomizing the HSSW Algorithm for 3-SATMAKINO, Kazuhisa; TAMAKI, Suguru; YAMAMOTO, Masaki et al.Algorithmica. 2013, Vol 67, Num 2, pp 112-124, issn 0178-4617, 13 p.Conference Paper

Derandomization that is rarely wrong from short advice that is typically goodGOLDREICH, Oded; WIGDERSON, Avi.Lecture notes in computer science. 2002, pp 209-223, issn 0302-9743, isbn 3-540-44147-6, 15 p.Conference Paper

A zero-one law for RP and derandomization of AM if NP is not smallIMPAGLIAZZO, Russell; MOSER, Philippe.Information and computation (Print). 2009, Vol 207, Num 7, pp 787-792, issn 0890-5401, 6 p.Article

A simpler and better derandomization of an approximation algorithm for single source rent-or-buyWILLIAMSON, David P; VAN ZUYLEN, Anke.Operations research letters. 2007, Vol 35, Num 6, pp 707-712, issn 0167-6377, 6 p.Article

EXPLICIT CONSTRUCTION OF A SMALL ∈-NET FOR LINEAR THRESHOLD FUNCTIONSRABANI, Yuval; SHPILKA, Amir.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3501-3520, issn 0097-5397, 20 p.Article

On the derandomization of constant depth circuitsKLIVANS, Adam R.Lecture notes in computer science. 2001, pp 249-260, issn 0302-9743, isbn 3-540-42470-9Conference Paper

A zero-one SUBEXP-dimension law for BPPMOSER, Philippe.Information processing letters. 2011, Vol 111, Num 9, pp 429-432, issn 0020-0190, 4 p.Article

Approximations for the maximum acyclic subgraph problemHASSIN, R; RUBINSTEIN, S.Information processing letters. 1994, Vol 51, Num 3, pp 133-140, issn 0020-0190Article

Hardness hypotheses, derandomization, and circuit complexityHITCHCOCK, John M; PAVAN, A.Lecture notes in computer science. 2004, pp 336-347, issn 0302-9743, isbn 3-540-24058-6, 12 p.Conference Paper

LOW-END UNIFORM HARDNESS VERSUS RANDOMNESS TRADEOFFS FOR AM : Theory of ComputingSHALTIEL, Ronen; UMANS, Christopher.SIAM journal on computing (Print). 2010, Vol 39, Num 3, pp 1006-1037, issn 0097-5397, 32 p.Article

How strong is Nisan's pseudo-random generator?DAVID, Matei; PAPAKONSTANTINOU, Periklis A; SIDIROPOULOS, Anastasios et al.Information processing letters. 2011, Vol 111, Num 16, pp 804-808, issn 0020-0190, 5 p.Article

QUASIRANDOM RUMOR SPREADING ON THE COMPLETE GRAPH IS AS FAST AS RANDOMIZED RUMOR SPREADINGFOUNTOULAKIS, Nikolaos; HUBER, Anna.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 4, pp 1964-1991, issn 0895-4801, 28 p.Article

Reconstructive Dispersers and Hitting Set GeneratorsUMANS, Christopher.Algorithmica. 2009, Vol 55, Num 1, pp 134-156, issn 0178-4617, 23 p.Conference Paper

CIRCUIT LOWER BOUNDS FOR MERLIN-ARTHUR CLASSES : Theory of ComputingSANTHANAM, Rahul.SIAM journal on computing (Print). 2010, Vol 39, Num 3, pp 1038-1061, issn 0097-5397, 24 p.Article

Holographic proofs and derandomizationVAN MELKEBEEK, Dieter; SANTHANAM, Rahul.SIAM journal on computing (Print). 2006, Vol 35, Num 1, pp 59-90, issn 0097-5397, 32 p.Article

Power from random stringsALLENDER, Eric; BUHRMAN, Harry; KOUCKY, Michal et al.SIAM journal on computing (Print). 2006, Vol 35, Num 6, pp 1467-1493, issn 0097-5397, 27 p.Article

Constructive quasi-Ramsey numbers and tournament rankingCZYGRINOW, A; POLJAK, S; RÖDL, V et al.SIAM journal on discrete mathematics (Print). 1999, Vol 12, Num 1, pp 48-63, issn 0895-4801Article

AN ALMOST OPTIMAL RANK BOUND FOR DEPTH-3 IDENTITIESSAXENA, Nitin; SESHADHRI, C.SIAM journal on computing (Print). 2011, Vol 40, Num 1, pp 200-224, issn 0097-5397, 25 p.Article

A Deterministic Approximation Algorithm for Maximum 2-Path Packing : Foundations of Computer ScienceTANAHASHI, Ruka; CHEN, Zhi-Zhong.IEICE transactions on information and systems. 2010, Vol 93, Num 2, pp 241-249, issn 0916-8532, 9 p.Article

Extracting randomness via repeated condensingREINGOLD, Omer; SHALTIEL, Ronen; WIGDERSON, Avi et al.SIAM journal on computing (Print). 2006, Vol 35, Num 5, pp 1185-1209, issn 0097-5397, 25 p.Article

When worlds collide: Derandomization, lower bounds, and Kolmogorov complexityALLENDER, Eric.Lecture notes in computer science. 2001, pp 1-15, issn 0302-9743, isbn 3-540-43002-4Conference Paper

A 3-approximation algorithm for the k-level uncapacitated facility location problemAARDAL, K; CHUDAK, F. A; SHMOYS, D. B et al.Information processing letters. 1999, Vol 72, Num 5-6, pp 161-167, issn 0020-0190Article

Deterministic Discrepancy MinimizationBANSAL, Nikhil; SPENCER, Joel.Algorithmica. 2013, Vol 67, Num 4, pp 451-471, issn 0178-4617, 21 p.Conference Paper

Proppian random walks in ZFREIRE, Juliana; SPENCER, Joel.Discrete mathematics. 2011, Vol 311, Num 5, pp 349-361, issn 0012-365X, 13 p.Article

Derandomization of PPSZ for unique-k-SATROLF, Daniel.Lecture notes in computer science. 2005, pp 216-225, issn 0302-9743, isbn 3-540-26276-8, 10 p.Conference Paper